Knowing Minimum/Maximum n Formulae
نویسندگان
چکیده
We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at least n different beliefs’. The resulting language allows us to express interesting properties of non-monotonic and resourcebounded reasoners. Other operators, such as ‘the reasoner has at most n different beliefs’ and the operator introduced in [1, 4]: ‘the reasoner knows at most the formulae φ1, . . . , φn’, are definable using min(n). We introduce several syntactic epistemic logics with min(n) operators, and prove completeness and decidability results for those logics.
منابع مشابه
Automatic Proofs for Formulae Enumerating Proper Polycubes
We develop a general framework for computing formulae enumerating polycubes of size n which are proper in n−k dimensions (spanning all n−k dimensions), for a fixed value of k. Besides the fundamental importance of knowing the number of these simple combinatorial objects, such formulae are central in the literature of statistical physics in the study of percolation processes and the collapse of ...
متن کاملProper n-cell Polycubes in n− k Dimensions
In this paper we develop a theoretical framework for computing the explicit formula enumerating polycubes with n cubes that span n−k dimensions, for a fixed k and variable n. Besides the fundamental importance of knowing the number of these simple combinatorial objects, known as proper polycubes, such formulae are central in the literature of statistical physics in the study of percolation proc...
متن کاملApproximate Closed-form Formulae for Buckling Analysis of Rectangular Tubes under Torsion
The buckling torque may be much less than the yield torque in very thin rectangular tubes under torsion. In this paper, simple closed-form formulae are presented for buckling analysis of long hollow rectangular tubes under torsion. By the presented formulae, one can obtain the critical torque or the critical angle of twist of the tube in terms of its geometrical parameters and material constant...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملAll they know in turn
This paper studies the reasoning of non-knowledge for multiple agents. In a multi-agent environment, agents may derive knowledge from the observation that other agents do not know a fact. That means normally there does not exist a vector of maximum relations that reflect the minimum knowledge (i.e. only knowing) of all agents. In this paper, we introduce a causal relation to characterize the ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006